double queue - vertaling naar russisch
Diclib.com
Woordenboek ChatGPT
Voer een woord of zin in in een taal naar keuze 👆
Taal:

Vertaling en analyse van woorden door kunstmatige intelligentie ChatGPT

Op deze pagina kunt u een gedetailleerde analyse krijgen van een woord of zin, geproduceerd met behulp van de beste kunstmatige intelligentietechnologie tot nu toe:

  • hoe het woord wordt gebruikt
  • gebruiksfrequentie
  • het wordt vaker gebruikt in mondelinge of schriftelijke toespraken
  • opties voor woordvertaling
  • Gebruiksvoorbeelden (meerdere zinnen met vertaling)
  • etymologie

double queue - vertaling naar russisch

ABSTRACT DATA TYPE FOR WHICH ELEMENTS CAN BE ADDED TO OR REMOVED FROM EITHER THE FRONT OR BACK
Doubly-ended queue; Deques; Double ended queue; Deque; Double-Ended Queue; Head-tail linked list; Doubly ended queue; Real-time deque
  • browsing history]]: new websites are added to the end of the queue, while the oldest entries will be deleted when the history is too large. When a user asks to clear the browsing history for the past hour, the most recently added entries are removed.

double queue      
1) двойная очередь
2) двухканальная система массового обслуживания
deque         

общая лексика

double-ended queue

двусторонняя очередь

Смотрите также

enqueue; queue

queuing         
  • 1940s poster promoting safety procedures during civil defense air raid drills.
  • People lined up when boarding a suburban bus in Prague.
  • Commuters at [[Osaka Station]] waiting to board a train. Queues for specific trains are marked by color-coded lines on the platform.
  • Waiting number ticket from the main post office of Prague 5 district, Czech Republic. The tickets contains a specification "Letter services – mass submits" and counters No. 8 and 9 which can deal with such a requirement.
  • Waiting queue call system in the Prague main post office. People have number tickets from the machine and are waiting until their number with a number of the counter appears at the red displays.
  • 1943 [[soup kitchen]] queue in [[Aarhus]], Denmark
LINE OF PEOPLE WAITING FOR GOODS OR SERVICES ON A FIRST-COME, FIRST-SERVED BASIS, OR AN AREA WHERE SUCH A LINE FORMS
Queue areas; Queueing; Waiting area; Queuing; Waiting in line; Wait in line; Standing in line; Waitlist management; Queue line
постановка в очередь, формирование очереди. Например, процедура, посредством которой вызовы, направляемые с MS или поступающие на MS, поддерживаются в состоянии ожидания в связи с перегрузкой радиотракта или занятостью вызываемой стороны.

Wikipedia

Double-ended queue

In computer science, a double-ended queue (abbreviated to deque, pronounced deck, like "cheque") is an abstract data type that generalizes a queue, for which elements can be added to or removed from either the front (head) or back (tail). It is also often called a head-tail linked list, though properly this refers to a specific data structure implementation of a deque (see below).

A deque is a data structure that allows insertion and removal of elements from both ends. This is different from a queue, which only allows insertion at one end and removal from the other end, following a first-in, first-out (FIFO) order. Deques can have several sub-types, including input-restricted deques, where deletion can be made from both ends but insertion can only be made at one end, and output-restricted deques, where insertion can be made at both ends but deletion can only be made from one end.

Deques are a fundamental data structure in computing, and many other data structures can be implemented using them. For example, queues and stacks can both be considered specializations of deques. The basic operations on a deque are adding elements to either end and removing elements from either end. Additionally, peek operations allow the value at one end to be examined without removing it.

There are at least two common ways to efficiently implement a deque: with a modified dynamic array or with a doubly linked list. Dynamic array-based deques, also called array deques, can grow from both ends and have all the properties of a dynamic array, such as constant-time random access and good locality of reference, with the addition of amortized constant-time insertion and removal at both ends. Three common implementations of array deques include storing deque contents in a circular buffer, allocating deque contents from the center of the underlying array, and storing contents in multiple smaller arrays. The other common implementation of deques is with a doubly linked list, which allows for constant-time insertion and removal at both ends, but with less efficient random access than dynamic array-based implementations.

Vertaling van &#39double queue&#39 naar Russisch